Directed search domain: a method for even generation of the Pareto frontier in multiobjective optimization
نویسندگان
چکیده
منابع مشابه
Methods for Quasi-even Generation of Pareto Frontier in Multiobjective Optimization Used in Engineering Design
A multiobjective optimization problem is considered in a general formulation. It is well known that the solution of the problem is not unique and represented in the objective space by a Pareto frontier. In an engineering design it can be important to provide a discrete representation of the entire Pareto surface. Meanwhile, the obtaining of a single Pareto solution may be time-consuming. Moreov...
متن کاملNumerical Method for Generating the Entire Pareto Frontier in Multiobjective Optimization
In multidisciplinary optimization a designer solves a problem where there are different criteria usually contradicting each other. In general, the solution of such a problem is not unique. When seeking an optimal design, it is natural to exclude from the consideration any design solution which can be improved without deterioration of any discipline and violation of the constraints; in other wor...
متن کاملAdaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
This paper presents an adaptive weighted sum (AWS) method for multiobjective optimization problems. The method extends the previously developed biobjective AWS method to problems with more than two objective functions. In the first phase, the usual weighted sum method is performed to approximate the Pareto surface quickly, and a mesh of Pareto front patches is identified. Each Pareto front patc...
متن کاملThe Quasi-Normal Direction (QND) Method: An Efficient Method for Finding the Pareto Frontier in Multi-Objective Optimization Problems
In managerial and economic applications, there appear problems in which the goal is to simultaneously optimize several criteria functions (CFs). However, since the CFs are in conflict with each other in such cases, there is not a feasible point available at which all CFs could be optimized simultaneously. Thus, in such cases, a set of points, referred to as 'non-dominate' points (NDPs), will be...
متن کاملA Multiobjective Frontier Search Algorithm
The paper analyzes the extension of frontier search to the multiobjective framework. A frontier multiobjective A* search algorithm is developed, some formal properties are presented, and its performance is compared to those of other multiobjective search algorithms. The new algorithm is adequate for both monotone and non-monotone heuristics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Optimization
سال: 2011
ISSN: 0305-215X,1029-0273
DOI: 10.1080/0305215x.2010.497185